A fast symmetric SVD algorithm for square Hankel matrices
نویسندگان
چکیده
This paper presents an O(n2 log n) algorithm for computing the symmetric singular value decomposition of square Hankel matrices of order n, in contrast with existing O(n3) SVD algorithms. The algorithm consists of two stages: first, a complex square Hankel matrix is reduced to a complex symmetric tridiagonal matrix using the block Lanczos method in O(n2 log n) flops; second, the singular values and singular vectors of the symmetric tridiagonal matrix resulted from the first stage are computed in O(n2) flops. The singular vector matrix is given in the form of a product of three or two unitary matrices. The performance of our algorithm is demonstrated by comparing it with the SVD subroutines in Matlab and LAPACK. © 2007 Published by Elsevier Inc. AMS classification: 15A18; 65F20; 65F25; 65F50
منابع مشابه
Multilinear Singular Value Decomposition for Structured Tensors
The Higher-Order SVD (HOSVD) is a generalization of the Singular Value Decomposition (SVD) to higher-order tensors (i.e. arrays with more than two indices) and plays an important role in various domains. Unfortunately, this decomposition is computationally demanding. Indeed, the HOSVD of a third-order tensor involves the computation of the SVD of three matrices, which are referred to as "modes"...
متن کاملTransformation Techniques for Toeplitz and Toeplitz-plus-hankel Matrices Part Ii. Algorithms
In the rst part 13] of the paper transformationsmappingToeplitz and Toeplitz-plus-Hankel matrices into generalizedCauchy matrices were studied. In this second part fast algorithms for LU-factorization and inversion of generalized Cauchy matrices are discussed. It is shown that the combinationof transformation pivoting techniques leads to algorithms for indeenite Toeplitz and Toeplitz-plus-Hanke...
متن کاملEvaluation of a Fast Algorithm for the Eigen-Decomposition of Large Block Toeplitz Matrices with Application to 5D Seismic Data Interpolation
We present a fast 5D (frequency and 4 spatial axes) reconstruction method that uses Multichannel Singular Spectrum Analysis / Cazdow algorithm. Rather than embedding the 4D spatial volume in a Hankel matrix, we propose to embed the data into a block Toeplitz form. Rank reduction is carried out via Lanczos bidiagonalization with fast block Toeplitz matrix-times-vector multiplications via 4D Fast...
متن کاملFast Hankel tensor-vector product and its application to exponential data fitting
This paper is contributed to a fast algorithm for Hankel tensor–vector products. First, we explain the necessity of fast algorithms for Hankel and block Hankel tensor–vector products by sketching the algorithm for both one-dimensional and multi-dimensional exponential data fitting. For proposing the fast algorithm, we define and investigate a special class of Hankel tensors that can be diagonal...
متن کامل2d-extension of Singular Spectrum Analysis: Algorithm and Elements of Theory
Singular Spectrum Analysis is a nonparametric method, which allows one to solve problems like decomposition of a time series into a sum of interpretable components, extraction of periodic components, noise removal and others. In this paper, the algorithm and theory of the SSA method are extended to analyse two-dimensional arrays (e.g. images). The 2D-SSA algorithm based on the SVD of a Hankel-b...
متن کامل